A New Validity Index for Fuzzy-Possibilistic C-Means Clustering
نویسندگان
چکیده
In some complicated datasets, due to the presence of noisy data points and outliers, cluster validity indices can give conflicting results in determining optimal number clusters. This paper presents a new index for fuzzy-possibilistic c-means clustering called Fuzzy-Possibilistic)FP (index, which works well clusters that vary shape density. Moreover, FPCM like most algorithms is susceptible initial parameters. this regard, addition clusters, requires priori selection degree fuzziness (m) typicality (?). Therefore, we presented an efficient procedure value . The proposed approach has been evaluated using several synthetic real-world datasets. Final computational demonstrate capabilities reliability compared with well-known fuzzy literature. Furthermore, clarify ability method real applications, implemented microarray gene expression medical image segmentation.
منابع مشابه
A Fuzzy C-means Algorithm for Clustering Fuzzy Data and Its Application in Clustering Incomplete Data
The fuzzy c-means clustering algorithm is a useful tool for clustering; but it is convenient only for crisp complete data. In this article, an enhancement of the algorithm is proposed which is suitable for clustering trapezoidal fuzzy data. A linear ranking function is used to define a distance for trapezoidal fuzzy data. Then, as an application, a method based on the proposed algorithm is pres...
متن کاملPrivacy Preserving Probabilistic Possibilistic Fuzzy C Means Clustering
Due to this uncontrollable growth of data, clustering played major role to partition into a small sets to do relevant processes within the small sets. Recently, the privacy and security are extra vital essentials when data is large and the data is distributed to other sources for various purposes. According to that, the privacy preservation should be done before distributing the data. In this s...
متن کاملKernel-based fuzzy and possibilistic c-means clustering
The 'kernel method' has attracted great attention with the development of support vector machine (SVM) and has been studied in a general way. In this paper, this 'method' is extended to the well-known fuzzy c-means (FCM) and possibilistic c-means (PCM) algorithms. It is realized by substitution of a kernel-induced distance metric for the original Euclidean distance, and the corresponding algori...
متن کاملOPTIMIZATION OF FUZZY CLUSTERING CRITERIA BY A HYBRID PSO AND FUZZY C-MEANS CLUSTERING ALGORITHM
This paper presents an efficient hybrid method, namely fuzzy particleswarm optimization (FPSO) and fuzzy c-means (FCM) algorithms, to solve the fuzzyclustering problem, especially for large sizes. When the problem becomes large, theFCM algorithm may result in uneven distribution of data, making it difficult to findan optimal solution in reasonable amount of time. The PSO algorithm does find ago...
متن کاملAn Adaptive Cluster Validity Index for the Fuzzy C-means
Based on the basic theory of fuzzy set, this paper suggests the notion of FCM fuzzy set, which is subject to the constraint condition of fuzzy c-means clustering algorithm. The cluster fuzzy degree and the lattice degree of approaching for the FCM fuzzy set are presented, and their functions in the validation process of fuzzy clustering are deeply analyzed. A new cluster validity index is propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientia Iranica
سال: 2021
ISSN: ['1026-3098', '2345-3605']
DOI: https://doi.org/10.24200/sci.2021.50287.1614